Accessing ACM/SIGCHI publications

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding and Accessing Diagrams in Biomedical Publications

Complex relationships in biomedical publications are often communicated by diagrams such as bar and line charts, which are a very effective way of summarizing and communicating multi-faceted data sets. Given the ever-increasing amount of published data, we argue that the precise retrieval of such diagrams is of great value for answering specific and otherwise hard-to-meet information needs. To ...

متن کامل

’ s repository of research publications and other research outputs Accessing and assessing lunar resources with PROSPECT

Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Introduction: A Package for Resource Observation and in-Situ Prospecting for Exploration, Commercial exploitation and Transportation (PROSPECT) is in devel...

متن کامل

The Open University ’ s repository of research publications and other research outputs Accessing and assessing lunar resources with PROSPECT

Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Introduction: A Package for Resource Observation and in-Situ Prospecting for Exploration, Commercial exploitation and Transportation (PROSPECT) is in devel...

متن کامل

Optimal accessing and non-accessing structures for graph protocols

An accessing set in a graph is a subset B of vertices such that ∃D ⊆ B, ∀v ∈ V \ B, |N (v) ∩ D| = 0 mod 2. In this paper, we introduce new bounds on the minimal size κ(G) of an accessing set, and on the maximal size κ(G) of a non-accessing set of a graph G. We show strong connections with perfect codes and give explicitly κ(G) and κ(G) for several families of graphs. Finally, we show that the c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Interactions

سال: 2016

ISSN: 1072-5520,1558-3449

DOI: 10.1145/2911328